Search results for "Random number generation"

A Hardware and Secure Pseudorandom Generator for Constrained Devices

2018

Hardware security for an Internet of Things or cyber physical system drives the need for ubiquitous cryptography to different sensing infrastructures in these fields. In particular, generating strong cryptographic keys on such resource-constrained device depends on a lightweight and cryptographically secure random number generator. In this research work, we have introduced a new hardware chaos-based pseudorandom number generator, which is mainly based on the deletion of an Hamilton cycle within the $N$ -cube (or on the vectorial negation), plus one single permutation. We have rigorously proven the chaotic behavior and cryptographically secure property of the whole proposal: the mid-term eff…

Construction of pseudo-random sequences from chaos

2002

Exploiting seeding of random number generators for efficient domain decomposition parallelization of dissipative particle dynamics

2013

Abstract Dissipative particle dynamics (DPD) is a new promising method commonly used in coarse-grained simulations of soft matter and biomolecular systems at constant temperature. The DPD thermostat involves the evaluation of stochastic or random forces between pairs of neighboring particles in every time step. In a parallel computing environment, the transfer of these forces from node to node can be very time consuming. In this paper we describe the implementation of a seeded random number generator with three input seeds at each step which enables the complete generation of the pairwise stochastic forces in parallel DPD simulations with minimal communication between nodes.

Secure random number generation in wireless sensor networks

2014

The increasing adoption of wireless sensor networks as a flexible and inexpensive tool for the most diverse applications, ranging from environmental monitoring to home automation, has raised more and more attention to the issues related to the design of specifically customized security mechanisms. The scarcity of computational, storage, and bandwidth resources cannot definitely be disregarded in such context, and this makes the implementation of security algorithms particularly challenging. This paper proposes a security framework for the generation of true random numbers, which are paramount as the core building block for many security algorithms; the intrinsic nature of wireless sensor no…

On a Non-periodic Shrinking Generator

2011

We present a new non-periodic random number generator based on the shrinking generator. The A-sequence is still generated using a LFSR, but the S-sequence is replaced by a finitely generated bi-ideal - a non-periodic sequence. The resulting pseudo-random sequence performs well in statistical tests. We show a method for the construction of an infinite number of finitely generated bi-ideals from a given A-sequence, such that the resulting sequence of the shrinking generator is nonperiodic. Further we prove the existence of what we call universal finitely generated bi-ideals that produce non-periodic words when used as the S-sequence of a shrinking generator for all non-trivial periodic A-sequ…

A Novel Multi-step Finite-State Automaton for Arbitrarily Deterministic Tsetlin Machine Learning

2020

Due to the high energy consumption and scalability challenges of deep learning, there is a critical need to shift research focus towards dealing with energy consumption constraints. Tsetlin Machines (TMs) are a recent approach to machine learning that has demonstrated significantly reduced energy usage compared to neural networks alike, while performing competitively accuracy-wise on several benchmarks. However, TMs rely heavily on energy-costly random number generation to stochastically guide a team of Tsetlin Automata (TA) to a Nash Equilibrium of the TM game. In this paper, we propose a novel finite-state learning automaton that can replace the TA in TM learning, for increased determinis…

Simulated one-pass list-mode: an approach to on-the-fly system matrix calculation.

2013

In the development of prototype systems for positron emission tomography a valid and robust image reconstruction algorithm is required. However, prototypes often employ novel detector and system geometries which may change rapidly under optimization. In addition, developing systems generally produce highly granular, or possibly continuous detection domains which require some level of on-the-fly calculation for retention of measurement precision. In this investigation a new method of on-the-fly system matrix calculation is proposed that provides advantages in application to such list-mode systems in terms of flexibility in system modeling. The new method is easily adaptable to complicated sy…

Random walks and random numbers from supercontinuum generation

2012

International audience; We report a numerical study showing how the random intensity and phase fluctuations across the bandwidth of a broadband optical supercontinuum can be interpreted in terms of the random processes of random walks and L´evy flights. We also describe how the intensity fluctuations can be applied to physical random number generation. We conclude that the optical supercontinuum provides a highly versatile means of studying and generating a wide class of random processes at optical wavelengths.

Random bit generation through polarization chaos in nonlinear optical fibers

2017

Nowadays, cryptographic applications are becoming of paramount importance in order to guarantee ultimately secure communications. Performances of classical and quantum key distribution and encryption algorithms are strongly dependent on the used Random Number Generator (RNG). A good RNG must produce unpredictable, unreproducible and unbiased sequences of numbers. For this reason, many true random number generators relying on chaotic physical phenomena, such as chaotic oscillations of high-bandwidth lasers [1, 2] or polarization chaos from a VCSEL diode [3], have been developed. In this work, we propose a RNG implementation based on a different physical mechanism than the ones previously use…

2018

In this manuscript, we experimentally and numerically investigate the chaotic dynamics of the state-of-polarization in a nonlinear optical fiber due to the cross-interaction between an incident signal and its intense backward replica generated at the fiber-end through an amplified reflective delayed loop. Thanks to the cross-polarization interaction between the two-delayed counter-propagating waves, the output polarization exhibits fast temporal chaotic dynamics, which enable a powerful scrambling process with moving speeds up to 600-krad/s. The performance of this all-optical scrambler was then evaluated on a 10-Gbit/s On/Off Keying telecom signal achieving an error-free transmission. We a…